Lexicographic Max-Min Optimization for Efficient and Fair Bandwidth Allocation
نویسندگان
چکیده
In many multiple criteria optimization problems preserving fairness among individual outcomes becomes an important issue. This is particularly true for systems that are designed for multiple users or services like computer or telecommunication networks. In this paper we investigate a new approach to the resource allocation preserving the, so called, Max-Min Fairness (MMF) in the solution. We analyze its applicability to a hard discrete multiple commodity network flow problem, where the flow (bandwidth) for each pair of nodes is allocated to exactly one path chosen from a predefined set.
منابع مشابه
Sequential Algorithms for Max-Min Fair Bandwidth Allocation
Telecommunication networks are facing the increasing demand for Internet services. Therefore, a problem of network dimensioning with elastic traffic arises which requires to allocate bandwidth to maximize service flows with fair treatment of all the services. In such applications, the so-called Max-Min Fairness (MMF) solution concept is widely used to formulate the resource allocation scheme. I...
متن کاملLexicographic Max-Min Fairness in a Wireless Ad Hoc Network with Random Access
We consider the lexicographic max-min fair rate control problem at the link layer in a random access wireless network. In lexicographic max-min fair rate allocation, the minimum link rates are maximized in a lexicographic order. For the Aloha multiple access model, we propose iterative approaches that attain the optimal rates under very general assumptions on the network topology and communicat...
متن کاملOn multi - criteria approaches to bandwidth allocation
Modern telecommunication networks face an increasing demand for services. Among these, an increasing number are services that can adapt to available bandwidth, and are therefore referred to as elastic traffic. Nominal network design for elastic traffic becomes increasingly significant. Typical resource allocation methods are concerned with the allocation of limited resources among competing act...
متن کاملCore Stateless Fair Bandwidth Allocation for Unicast and Multicast Flows
In this paper we aim at developing a solution to fairly allocating bandwidth among unicast and multicast flows. For this purpose, we propose the anycast max-min fairness criterion, which is based on the well known max-min fairness criterion for unicast. We then present an efficient implementation of the proposed criterion: the Multicast Fair Bandwidth Allocation (MFBA) architecture. The MFBA ar...
متن کاملAchieving Max-Min lifetime and fairness with rate allocation for data aggregation in sensor networks
We consider the rate allocation problem for data aggregation in wireless sensor networks with two objectives: 1) maximizing the minimum (Max-Min) lifetime of an aggregation cluster and 2) achieving fairness among all data sources. The two objectives are generally correlated with each other and usually, they cannot be maximized simultaneously. We adopt a lexicographic method to solve this multi-...
متن کامل